Non-Trivial t-Intersection in the Function Lattice
نویسندگان
چکیده
The function lattice, or generalized Boolean algebra, is the set of `-tuples with the ith coordinate an integer between 0 and a bound ni. Two `-tuples t-intersect if they have at least t common nonzero coordinates. We prove a Hilton–Milner type theorem for systems of t-intersecting `-tuples.
منابع مشابه
Intersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملFunctional Decomposition Using Principal Subfields
Let f ∈ K(t) be a univariate rational function. It is well known that any non-trivial decomposition g ◦ h, with g, h ∈ K(t), corresponds to a non-trivial subfield K(f(t)) ( L ( K(t) and vice-versa. In this paper we use the idea of principal subfields and fast subfield-intersection techniques to compute the subfield lattice of K(t)/K(f(t)). This yields a Las Vegas algorithm with improved complex...
متن کاملExistence of non-trivial solutions for fractional Schrödinger-Poisson systems with subcritical growth
In this paper, we are concerned with the following fractional Schrödinger-Poisson system: (−∆s)u + u + λφu = µf(u) +|u|p−2|u|, x ∈R3 (−∆t)φ = u2, x ∈R3 where λ,µ are two parameters, s,t ∈ (0,1] ,2t + 4s > 3 ,1 < p ≤ 2∗ s and f : R → R is continuous function. Using some critical point theorems and truncation technique, we obtain the existence and multiplicity of non-trivial solutions with ...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملCHARACTERIZING TOLERANCE TRIVIAL FINITE ALGEBRASIvan
An algebra A is tolerance trivial if Tol A = ConA where Tol A is the lattice of all tolerances on A. If A contains a Mal'cev function compatible with each T Tol A, then A is tolerance trivial. We investigate nite algebras satisfying also the converse statement. Let R be a binary relation on a set A and f be an n-ary function on A. We say that f is compatible with R or that R is compatible with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006